Computing Planarity in Computable Planar Graphs
نویسندگان
چکیده
We use methods from computability theory to answer questions about infinite planar graphs. A graph is computable if there is an algorithm which decides whether given vertices are adjacent. Having a procedure for deciding the edge set might not help compute other properties or features of the graph, however. The goal of this paper is to investigate the extent to which features related to the planarity of a graph might or might not be computable. We propose three definitions for what it might mean for a computable graph to be computably planar and for each build a computable planar graph which fails to be computably planar. We also consider these definitions in the context of highly computable graphs, those for which there is an algorithm which computes the degree of a given
منابع مشابه
Planarity Testing for C-Connected Clustered Graphs
We present a linear time algorithm for testing clustered planarity of c-connected clustered graphs and for computing a clustered planar embedding for such graphs. Our algorithm uses a decomposition of the input graph based on SPQR-trees and is the first linear time algorithm for clustered planarity testing. We define a normal form of clustered embeddings and show that a clustered graph is clust...
متن کاملAlgorithms for Testing and Embedding Planar Graphs
2 Embedding graphs into planarity 3 2.1 embedding algorithms donot use PQ-trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1.1 A planarity embedding algorithm based on the Kuratowski theorem . . . . . . . . 3 2.1.2 An embedding algorithm based on open ear decomposition . . . . . . . . . . . . . . 3 2.1.3 A simplified o (n) planar embedding algorithm for biconnected graphs . . ....
متن کاملOn the planarity of a graph related to the join of subgroups of a finite group
Let $G$ be a finite group which is not a cyclic $p$-group, $p$ a prime number. We define an undirected simple graph $Delta(G)$ whose vertices are the proper subgroups of $G$, which are not contained in the Frattini subgroup of $G$ and two vertices $H$ and $K$ are joined by an edge if and only if $G=langle H , Krangle$. In this paper we classify finite groups with planar graph. ...
متن کاملOn the Non-Planarity of a Random Subgraph
Let G be a finite graph with minimum degree r. Form a random subgraph Gp of G by taking each edge of G into Gp independently and with probability p. We prove that for any constant ǫ > 0, if p = 1+ǫ r , then Gp is non-planar with probability approaching 1 as r grows. This generalizes classical results on planarity of binomial random graphs. AMS Classification: 05C80, 05C10.
متن کاملCircle planarity of level graphs
In this thesis we generalise the notion of level planar graphs in two directions: track planarity and radial planarity. Our main results are linear time algorithms both for the planarity test and for the computation of an embedding, and thus a drawing. Our algorithms use and generalise PQ-trees, which are a data structure for efficient planarity tests. A graph is a level graph, if it has a part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 32 شماره
صفحات -
تاریخ انتشار 2016